Why Is Boolean Complexity Theory Diicult?
نویسنده
چکیده
منابع مشابه
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Boolean Similarity Measures for Resource
| As the number of Internet servers increases rapidly, it becomes diicult to determine the relevant servers when searching for information. We develop a new method to rank Internet servers for Boolean queries. Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. We contrast it with other known methods and describe its implementation.
متن کاملA survey of Evasiveness: Lower Bounds on the Decision-Tree Complexity of Boolean Functions
The decision tree complexity of a boolean function F of n arguments is the depth of a minimum-depth decision tree that computes F correctly on every input. A boolean function F of n arguments is cn-evasive if its decision tree complexity is cn, (c < 1). F is completely evasive, (n-evasive), if all of its arguments need to be probed in the worst case. When we restrict the properties and form of ...
متن کاملThe complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon’s principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit complexity. The two main criteria evaluating the cryptographic complexity of Boolean functions on F n 2 are the nonlinearity (and more generally the r-th order nonlinearity, for every positive r < n) and the algebraic degree. Tw...
متن کاملExperimental Results on the Crossover Point inSatis ability
Determining whether a propositional theory is satissable is a prototypical example of an NP-complete problem. Further, a large number of problems that occur in knowledge representation, learning, planning, and other areas of AI are essentially satissability problems. This paper reports on a series of experiments to determine the location of the crossover point | the point at which half the rand...
متن کاملFilter theory in MTL-algebras based on Uni-soft property
The notion of (Boolean) uni-soft filters in MTL-algebras is introduced, and several properties of them are investigated. Characterizations of (Boolean) uni-soft filters are discussed, and some (necessary and sufficient) conditions for a uni-soft filter to be Boolean are provided. The condensational property for a Boolean uni-soft filter is established.
متن کامل